In generic programming, a concept is a description of supported operations on a type, including syntax and semantics. In this way, concepts are related to abstract base classes but concepts do not require a subtype relationship.
Contents |
The term was in use as early as 1998 for STL[1], as this was one of the first libraries that extensively used templates.
Primarily (in C++ 1998 standard), the Concept term was introduced to name just a simple description of the requirements for particular type, usually being a template parameter. It was never encoded in the language explicitly - the concept was expressed only by what operations are tried to be performed on objects of that type and what is expected to work (that is, to compile correctly).
As generics in Java and C# have some similarities to C++'s templates, the role of concepts there is played by interfaces. However there is one important difference between concepts and interfaces: when a template parameter is required to implement a particular interface, the matching type can only be a class that implements (explicitly) that interface. Concepts bring more flexibility because they can be satisfied by two ways:
Another language implementing something very similar to concepts is Haskell, where the feature is called type classes.
For example, if a type I satisfies the Trivial Iterator concept in C++, and i is of type I, the following are valid expressions with corresponding semantics:[2]
I i default construction.*i must be convertible to some type T.i->m is valid if (*i).m is.